Program analysis for code duplication in logic programs
نویسنده
چکیده
In this PhD project, we deal with the issue of code duplication in logic programs. In particular semantical duplication or redundancy is generally viewed as a possible seed of inconvenience in all phases of the program lifecycle, from development to maintenance. The core of this research is the elaboration of a theory of semantical duplication, and of an automated program analysis capable of detecting such duplication and which could steer, to some extent, automatic refactoring of program code.
منابع مشابه
Fingerprinting Logic Programs
In this work we present work in progress on functionality duplication detection in logic programs. Eliminating duplicated functionality recently became prominent in context of refactoring. We describe a quantitative approach that allows to measure the “similarity” between two predicate definitions. Moreover, we show how to compute a so-called “fingerprint” for every predicate. Fingerprints capt...
متن کاملAutomatic Structuring of Programs
A method is described that allows the translation of a traditionally written (unstructured) program into a set of top-down structured, semantically founded, GoTo-free modules. The method reveals not nly the logic of a given program in a most natural way, but it also reduces code duplication to a minimum. It is further shown how the obtained structured program can be mapped back into a GOTO prog...
متن کاملDissertation : Incremental Maintenance of Recursive Views with Applications to Tabled Logic Programming
Vulnerability analysis using dynamic attack graphs, dynamic binary analysis for mobile code security, incre-mental bisimulation algorithm. Development of algorithms for incremental evaluation of tabled logic programs and its application to program analysis, generation and analysis of multiple counterexamples for error cause localization, model checking security-relevant properties of sequential...
متن کاملHorn clauses as an intermediate representation for program analysis and transformation
Many recent analyses for conventional imperative programs begin by transforming programs into logic programs, capitalising on existing LP analyses and simple LP semantics. We propose using logic programs as an intermediate program representation throughout the compilation process. With restrictions ensuring determinism and single-modedness, a logic program can easily be transformed to machine l...
متن کاملThe Space Overhead of Customization
Customization aims to improve the performance of pure object-oriented languages by compiling multiple copies of a source method, each of them specialized for a certain revceiver type. Like other code duplication techniques, it gains performance by trading code space for better speed. Unfortunately, customization can significantly increase code space, especially for larger programs. We show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010